0 Se p 20 09 Entanglement of graph states up to 8 qubits

نویسنده

  • Xiao-yu Chen
چکیده

The entanglement of graph states up to eight qubits is calculated in the regime of iteration calculation. The entanglement measures could be the relative entropy of entanglement, the logarithmic robustness or the geometric measure. All 146 local inequivalent graphs are classified as two categories: graphs with identical upper LOCC entanglement bound and lower bipartite entanglement bound, graphs with unequal bounds. The late may displays noninteger entanglement. The precision of iteration calculation of the entanglement is less than 10−14. PACS number(s): 03.67.Mn, 03.65.Ud, 02.10.Ox Keyword(s): graph state; iteration; multipartite entanglement

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

09 04 1 v 3 1 4 Se p 20 00 Entangled Rings

Consider a ring of N qubits in a translationally invariant quantum state. We ask to what extent each pair of nearest neighbors can be entangled. Under certain assumptions about the form of the state, we find a formula for the maximum possible nearest-neighbor entanglement. We then compare this maximum with the entanglement achieved by the ground state of an antiferromagnetic ring consisting of ...

متن کامل

ua nt - p h / 00 09 06 3 v 1 1 4 Se p 20 00 Entanglement of Formation of an Arbitrary State of Two Rebits ∗

We consider entanglement for quantum states defined in vector spaces over the real numbers. Such real entanglement is different from entanglement in standard quantum mechanics over the complex numbers. The differences provide insight into the nature of entanglement in standard quantum theory. Wootters [Phys. Rev. Lett. 80, 2245 (1998)] has given an explicit formula for the entanglement of forma...

متن کامل

ar X iv : 0 90 9 . 16 03 v 1 [ qu an t - ph ] 9 S ep 2 00 9 Entanglement of graph states up to 8 qubits

The entanglement of graph states up to eight qubits is calculated in the regime of iteration calculation. The entanglement measures could be the relative entropy of entanglement, the logarithmic robustness or the geometric measure. All 146 local inequivalent graphs are classified as three categories: the 2-colorable graphs, the non 2colorable graphs with identical upper LOCC entanglement bound ...

متن کامل

ar X iv : 0 70 4 . 20 87 v 2 [ qu an t - ph ] 2 7 Se p 20 07 The SLOCC invariant and the residual entanglement for n - qubits ∗

In this paper, we find the invariant for n-qubits and propose the residual entanglement for n-qubits by means of the invariant. Thus, we establish a relation between SLOCC entanglement and the residual entanglement. The invariant and the residual entanglement can be used for SLOCC entanglement classification for n-qubits. PACS numbers: 03.67.-a, 03.65.Ta, 89.70.+c

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009